Explaining the Perfect Sampler
نویسندگان
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
Rapidly Mixing Chain and Perfect Sampler for Logarithmic Separable Concave Distributions on Simplex†
In this paper, we are concerned with random sampling of an n dimensional integral point on an (n−1) dimensional simplex according to a multivariate discrete distribution. We employ sampling via Markov chain and propose two “hit-and-run” chains, one is for approximate sampling and the other is for perfect sampling. We introduce an idea of alternating inequalities and show that a logarithmic sepa...
متن کاملA GIBBS SAMPLER ON THE N - SIMPLEX By Aaron
We determine the mixing time of a simple Gibbs sampler on the unit simplex, confirming a conjecture of D. Aldous. The upper bound is based on a two-step coupling, where the first step is a simple contraction argument and the second step is a non-Markovian coupling. We also present a MCMC-based perfect sampling algorithm that is based on our proof and which can be applied to Gibbs samplers that ...
متن کاملA Gibbs Sampler on the N-simplex
We determine the mixing time of a simple Gibbs sampler on the unit simplex, confirming a conjecture of D. Aldous. The upper bound is based on a two-step coupling, where the first step is a simple contraction argument and the second step is a non-Markovian coupling. We also present a MCMC-based perfect sampling algorithm that is based on our proof and which can be applied to Gibbs samplers that ...
متن کاملRandomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
In this paper, we propose a fully polynomial-time randomized approximation scheme (FPRAS) for the closed Jackson network. Our algorithm is based on Markov chain Monte Carlo (MCMC) method. Thus, our scheme returns an approximate solution, of which the size of error satisfies a given error rate. To our knowledge, the algorithm is the first polynomial time MCMC algorithm for closed Jackson network...
متن کاملPolynomial-time Perfect Sampler for Closed Jackson Networks with Single Servers
In this paper, we propose a sampler for the product-form solution of basic queueing networks, closed Jackson networks with single servers. Our approach is sampling via Markov chain, but it is NOT a simulation of behavior of customers in queueing networks. We propose a new ergodic Markov chain whose unique stationary distribution is the product form solution of a closed Jackson Network, thus we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001